翻訳と辞書 |
Doubly logarithmic tree : ウィキペディア英語版 | Doubly logarithmic tree
In computer science a doubly logarithmic tree is a tree where each internal node of height 1, the tree layer above the leaves, has two children, and each internal node of height has leaves. The number of children at a node as we go from leaf to root is 0,2,2,4,16, 256, 65536, ... A similar tree called a k-merger is used in Prokop et al.'s cache oblivious Funnelsort to merge elements. File:Double log tree.png ==Notes==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Doubly logarithmic tree」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|